Universal automata with uniform bounds on simulation time
نویسندگان
چکیده
منابع مشابه
Universal Automata with Uniform Bounds on Simulation Time
the re is no uniform bound on the loss of time incurred when some universal automaton globally simulates another automaton. More precisely, define an automaton to be a partial recursive function with decidable domain. Say that an automaton U locally simulates an automaton f via recursive, injective encoding cr with recursive time bound b iff for all z, z ' C IN the following holds: f ( z ) = z'...
متن کاملQuasi-Uniform Computation-Universal Cellular Automata
Cellular automata (CA) are dynamical systems in which space and time are discrete , where each cell obeys the same rule and has a nite number of states. In this paper we study non-uniform CA, i.e. with non-uniform local interaction rules. Our focal point is the issue of universal computation, which has been proven for uniform automata using complicated designs embedded in cellular space. The co...
متن کاملUNIFORM AND SEMI-UNIFORM TOPOLOGY ON GENERAL FUZZY AUTOMATA
In this paper, we dene the concepts of compatibility between twofuzzy subsets on Q, the set of states of a max- min general fuzzy automatonand transitivity in a max-min general fuzzy automaton. We then construct auniform structure on Q, and dene a topology on it. We also dene the conceptof semi-uniform structures on a nonempty set X and construct a semi-uniformstructure on the set of states of ...
متن کاملBarbosa, Uniform Polynomial Time Bounds, and Promises
This note is a commentary on, and critique of, André Luiz Barbosa’s paper entitled “P != NP Proof.” Despite its provocative title, what the paper is seeking to do is not to prove P 6= NP in the standard sense in which that notation is used in the literature. Rather, Barbosa is (and is aware that he is) arguing that a different meaning should be associated with the notation P 6= NP, and he claim...
متن کاملBounds on Universal Sequences
Universal sequences for graphs, a concept introduced by Aleliunas [M. are studied. By letting U(d, n) denote the minimum length of a universal sequence for d-regular undirected graphs with n nodes, the latter paper has proved the upper bound U(d, n)= O(d2r log n) using a probabilistic argument. Here a lower bound of U(2, n)-(n log n) is proved from which U(d, n)-l'I(n log n) for all d is deduce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1982
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(82)80083-1